Garbling of signals and outcome equivalence

نویسندگان

  • Ehud Lehrer
  • Dinah Rosenberg
  • Eran Shmaya
چکیده

In a game with incomplete information players receive stochastic signals about the state of nature. The distribution of the signals given the state of nature is determined by the information structure. Different information structures may induce different equilibria. Two information structures are equivalent from the perspective of a modeler, if they induce the same equilibrium outcomes. We characterize the situations in which two information structures are equivalent in terms of natural transformations, called garblings, from one structure to another. We study the notion of ‘being equivalent to’ in relation with three equilibrium concepts: Nash equilibrium, agent normal-form correlated equilibrium and the belief invariant Bayesian solution. Date: May 2, 2013.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reactive Garbling: Foundation, Instantiation, Application

Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and threeparty secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes the syntax and security properties of garbled circuits. We define a generalization of garbling schemes called reactive garbling schemes. We conside...

متن کامل

Partial Garbling Schemes and Their Applications

Garbling schemes (aka randomized encodings of functions) represent a function F by a “simpler” randomized function F̂ such that F̂ (x) reveals F (x) and no additional information about x. Garbling schemes have found applications in many areas of cryptography. Motivated by the goal of improving the efficiency of garbling schemes, we make the following contributions: – We suggest a general new noti...

متن کامل

Foundations of Reactive Garbling Schemes

Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and three-party secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes the syntax and security properties of garbled circuits. We de€ne a generalization of garbling schemes called reactive garbling schemes. We conside...

متن کامل

TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation

This paper reports on a number of conceptual and technical contributions to the currently very lively field of two-party computation (2PC) based on garbled circuits. Our main contributions are as follows: 1. We propose a notion of an interactive garbling scheme, where the garbled circuit is generated as an interactive protocol between the garbler and the evaluator. The garbled circuit is correc...

متن کامل

Garbling Schemes

Garbled circuits, a classical idea rooted in the work of Andrew Yao, have long been understood as a cryptographic technique, not a cryptographic goal. Here we cull out a primitive corresponding to this technique. We call it a garbling scheme . We provide a provable-security treatment for garbling schemes, endowing them with a versatile syntax and multiple security definitions. The most basic of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2013